A penalty method and a regularization strategy to solve MPCC
نویسندگان
چکیده
The goal of this paper is to solve Mathematical Program with Complementarity Constraints (MPCC) using nonlinear programming (NLP) techniques. This work presents two algorithms based on several nonlinear techniques such as Sequential Quadratic Programming (SQP), penalty techniques and regularization schemes. A set of AMPL problems were tested and the computational experience shows that both algorithms are effective.
منابع مشابه
Convergence of a Penalty Method for Mathematical Programming with Complementarity Constraints
We adapt the convergence analysis of smoothing (Ref. 1) and regularization (Ref. 2) methods to a penalty framework for mathematical programs with complementarity constraints (MPCC), and show that the penalty framework shares similar convergence properties to these methods. Moreover, we give sufficient conditions for a sequence generated by the penalty framework to be attracted to a B-stationary...
متن کاملCombining the regularization strategy and the SQP to solve MPCC - A MATLAB implementation
Mathematical Program with Complementarity Constraints (MPCC) plays a very important role in many fields such as engineering design, economic equilibrium, multilevel game, and mathematical programming theory itself. In theory its constraints fail to satisfy a standard constraint qualification such as the linear independence constraint qualification (LICQ) or the Mangasarian-Fromovitz constraint ...
متن کاملA regularization method for solving a nonlinear backward inverse heat conduction problem using discrete mollification method
The present essay scrutinizes the application of discrete mollification as a filtering procedure to solve a nonlinear backward inverse heat conduction problem in one dimensional space. These problems are seriously ill-posed. So, we combine discrete mollification and space marching method to address the ill-posedness of the proposed problem. Moreover, a proof of stability and<b...
متن کاملProximal methods for the latent group lasso penalty
We consider a regularized least squares problem, with regularization by structured sparsity-inducing norms, which extend the usual `1 and the group lasso penalty, by allowing the subsets to overlap. Such regularizations lead to nonsmooth problems that are difficult to optimize, and we propose in this paper a suitable version of an accelerated proximal method to solve them. We prove convergence ...
متن کاملArc-length Method for Frictional Contact with a Criterion of Maximum Dissipation of Energy
An arc-length equilibrium path-following method is proposed for two-dimensional quasi-static frictional contact problems. We consider the Coulomb friction law as well as geometrical nonlinearity. Incorporating a criterion of maximum dissipation of energy, we propose a formulation as a mathematical program with complementarity constraints (MPCC) in order to avoid unloading solutions in which mos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Math.
دوره 88 شماره
صفحات -
تاریخ انتشار 2011